Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence
نویسندگان
چکیده
We study the numerical evaluation of Legendre polynomials $P_n$ onthe interval $[-1,1]$ via a three-term recurrence. prove that ina neighborhood an endpoint, computed approximation exactlyagrees with line tangent to at this endpoint. As aconsequence, we obtain sharp error bounds for
منابع مشابه
Numerical Calculation of Fractional Derivatives for the Sinc Functions via Legendre Polynomials
This paper provides the fractional derivatives of the Caputo type for the sinc functions. It allows to use efficient numerical method for solving fractional differential equations. At first, some properties of the sinc functions and Legendre polynomials required for our subsequent development are given. Then we use the Legendre polynomials to approximate the fractional deri...
متن کاملThe root distribution of polynomials with a three-term recurrence
For any fixed positive integer n, we study the root distribution of a sequence of polynomials Hm(z) satisfying the rational generating function ∞ ∑ m=0 Hm(z)t m = 1 1 +B(z)t+A(z)tn where A(z) and B(z) are any polynomials in z with complex coefficients. We show that the roots of Hm(z) which satisfy A(z) 6= 0 lie on a specific fixed real algebraic curve for all large m.
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Transactions on Numerical Analysis
سال: 2021
ISSN: ['1068-9613', '1097-4067']
DOI: https://doi.org/10.1553/etna_vol54s323